搜索资源列表
ReadLog
- 使用CTreeCtrl遍历硬盘所有文件，然后显示出来，点击树节点，在右边的CListCtrl里用图标显示出该文件下的文件，鼠标左键点击某文件，实现打开文件的功能。 功能类似于WINDOWS的文件夹功能-CTreeCtrl traverse all the files using the hard disk, and then displayed, click on the tree node, the right to use CListCtrl in icon shows the file
3GPFileDecoder
- 用于查看3gp mov mp4 文件格式框架. 新增了结构树浏览, 双击左侧树的节点可以显示当前的节点内部结构. 支持文件格式3g2 3gp, mov, mp4 等符合3gpp的文件。-Used to view 3gp mov mp4 file format framework. Add the tree view, double-click the left side of the tree node to show the internal structure of the curre
proba-mib
- net-snmp 扩展 MIB , mib tree节点为简单变量（即标量）的源代码-net-snmp extension MIB, mib tree node for the simple variables (ie, scalar) source code
treenode
- 编写一个能动态改变树结点的程序，这是一种利用TreeNode构造动态树的事例-Write a dynamically changing tree node procedure, which is a dynamic tree structure using the example of TreeNode
RedBlackGraph
- Graphic implementation of a red-blak tree in wich can insert, search a node and always see the graphical tr-Graphic implementation of a red-blak tree in wich can insert, search a node and always see the graphical tree
homework
- 设二叉树的结点的数据场之值仅为一大写英文字母。其前序和中序的遍历结果（打印结点的数据场之值）分别保存在字符串数组 preorder[N] 及 inorder[N]之中，其中 N 为常数。请设计程序以标准形式存储保存该二叉树。-Based binary tree node data field of the value is only a capital letter. The pre-order traversal order and the results (the data field t
Insertthehreadede
- 线索二叉树中插入结点.各种情况的加入与判断-Insert the threaded binary tree node. All the circumstances of accession with the judge
Tree
- 1.16② 试写一算法，如果三个整数X，Y和Z 的值不是依次非递增的，则通过交换，令其为 非递增。 -Status Dencendant(Array1D L,Array1D R,int n,int u,int v) /* If node u is the dencendant of node v ,*/ /* then return TRUE else return FALSE . */ /* L[i] is the left child of the
tree
- 1.必须完成图的存储功能。图的输入可由命令行完成； 2.按遍历到的先后顺序依次输出G中各结点内容； 3.以文本形式输出生成树中各条边以及它们的权值。 -1. Must complete map of the storage function. Map the input command line can be completed 2. According to the order traversal order of the output G of the contents
Red-BlackTree
- 在C语言环境下，实现对红黑树的插入结点操作。-In the C language environment, achieving the insertion of the red-black tree node operation.
Unlimited_level_tree_node_ynamically-generate_VC_D
- 动态生成无限级树形节点的VC++文档管理器 -Unlimited level tree node dynamically generate the VC++ Documentation Manager
VC.tree.menu.node.add.connectivity
- VC实现树形菜单节点添加连线的功能代码VC tree menu node to achieve the functions of code to add connectivity -VC tree menu node to achieve the functions of code to add connectivity
java1
- 程序介绍：对树的一些常用操作进行了封装，包括查询，插入，删除，遍历二叉树（中序，后序，前序） 以及以树的方式显示二对树的各个结点。-Program Descr iption: The tree of some common operations of the package, including the query, insert, delete, traversing a binary tree (in order, postorder, preorder), and the tree dis
ThreeDemo
- 树节点的程序DEMO，完全自己开发，与大家分享了哦-Tree node procedure DEMO, completely on my own development, to share with you, oh
drag-tree
- 一个基于vc开发的树形控件，实现拖动结点，改名等效果-Vc-based development of a tree control to achieve drag the node, renamed effect
AVLtree
- AVL tree using node from data structure and algorithm java class, create a minimum AVL tree with minimum number of nodes at given high
CPropertytree
- 用来设置树形节点的属性框控件，VC++源代码，使用注意，选中树窗口中的结点后, 可以在属性窗口修改其属性。也就是鼠标只要一点击树形菜单中的任一节点，下边的属性窗就会处于高亮编辑状态，用来编辑树控属性非常方便。 -Used to set the tree node properties box control, VC++ source code, use the note, select the node in the tree window, you can modify its propert
binarysearchtree
- Binary Search Tree with Node class.-Binary Search Tree with Node class.
Red_Black_Tree
- 用java来实现的红黑树算法，包括红黑树的结点建立和插入。-Use java to implement red-black tree algorithms, including the establishment of red-black tree node and inserts.
4
- (1)已知一棵完全二叉树存放于一个一维数组T[n]中，T[n]中存放的是各结点的值。试设计一个算法，从T[0]开始顺序读出各结点的值，建立该二叉树的二叉链表表示。 (2)二叉树的双序遍历(Double-order traversal)是指：对于二叉树的每一个结点来说，先访问这个结点，再按双序遍历它的左子树，然后再一次访问这个结点，接下来按双序遍历它的右子树。试写出执行这种双序遍历的算法。 -(1) known to a complete binary tree stored in a o